Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment

We consider a problem of optimal grouping and provide conditions under which an optimal partition of an ordered set S = {r1, -*t , r,) consists of subsets of consecutive elements. We transform the problem into the problem of finding a shortest path on a directed acyclic graph with n + 1 vertices (for which efficient algorithms exist). These results may be used to solve the problem of grouping n...

متن کامل

Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment

We consider several subclasses of the problem of grouping n items (indexed 1, 2, .., n) into m subsets so as to minimize the function g(S 1 , .. , S,). In general, these problems are very difficult to solve to optimality, even for the case m = 2. We provide several sufficient conditions on g(') that guarantee that there is an optimum partition in which each subset consists of consecutive intege...

متن کامل

An Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions

We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...

متن کامل

An Eecient Optimal Solution Method for the Joint Replenishment Problem

During the last two decades, many heuristic procedures for the joint replenishment problem have appeared in the literature. The only available optimal solution procedure was based on an enumera-tive approach and was computationally prohibitive. In this paper we present an alternative optimal approach based on global optimisation theory. By applying Lipschitz optimisation one can nd a solution w...

متن کامل

Optimal ordering quantities for substitutable deteriorating items under joint replenishment with cost of substitution

In this paper we develop an inventory model, to determine the optimal ordering quantities, for a set of two substitutable deteriorating items. In this inventory model the inventory level of both items depleted due to demands and deterioration and when an item is out of stock, its demands are partially fulfilled by the other item and all unsatisfied demand is lost. Each substituted item incurs a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 1982

ISSN: 0030-364X,1526-5463

DOI: 10.1287/opre.30.5.1018